Visual Tracking via Supervised Similarity Matching
نویسندگان
چکیده
Supervised learning algorithms have been widely applied in tracking-by-detection based methods for object tracking in recent years. Most of these approaches treat tracking as a classification problem and solve it by training a discriminative classifier and exhaustively evaluating every possible target position; problems thus exist for two reasons. First, since the classifier describes the common feature of samples in an implicit way, it is not clear how well the classifier can represent the feature of the desired object against others; second, the brute-force search within the output space is usually time consuming, and thus limits the competence for real-time application. In this paper, we treat object tracking as a problem of similarity matching for streaming data. We propose to apply unsupervised learning by Locality Sensitive Hashing (LSH) and use LSH based similarity matching as the main engine for target detection. In addition, our method applies a Support Vector Machine (SVM) based supervised classifier cooperating with the unsupervised detector. Both the proposed tracker and several selected trackers are tested on some well accepted challenging videos; and the experimental results demonstrate that the proposed tracker outperforms the selected other trackers in terms of the effectiveness as well as the robustness.
منابع مشابه
Fusion with Diffusion for Robust Visual Tracking
A weighted graph is used as an underlying structure of many algorithms like semisupervised learning and spectral clustering. If the edge weights are determined by a single similarity measure, then it hard if not impossible to capture all relevant aspects of similarity when using a single similarity measure. In particular, in the case of visual object matching it is beneficial to integrate diffe...
متن کاملDiscriminative Tracking by Metric Learning
We present a discriminative model that casts appearance modeling and visual matching into a single objective for visual tracking. Most previous discriminative models for visual tracking are formulated as supervised learning of binary classifiers. The continuous output of the classification function is then utilized as the cost function for visual tracking. This may be less desirable since the f...
متن کاملOntology Similarity Measuring and Ontology Mapping Algorithms Via Graph Semi-Supervised Learning
Ontology similarity calculation is important research topics in information retrieval and widely used in biology and chemical. By analyzing the technology of semi-supervised learning, we propose the new algorithm for ontology similarity measure and ontology mapping. The ontology function is obtained by learning the ontology sample data which is consisting of labeled and unlabeled ontology data....
متن کاملAdaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملComposite Kernel Optimization in Semi-Supervised Metric
Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...
متن کامل